M/G/1-Type Markov Processes: A Tutorial
نویسندگان
چکیده
M/G/1-type processes are commonly encountered when modeling modern complex computer and communication systems. In this tutorial, we present a detailed survey of existing solution methods for M/G/1-type processes, focusing on the matrix-analytic methodology. From first principles and using simple examples, we derive the fundamental matrix-analytic results and lay out recent advances. Finally, we give an overview of an existing, state-of-the-art software tool for the analysis of M/G/1-type processes.
منابع مشابه
Several Types of Ergodicity for M/g/1-type Markov Chains and Markov Processes
In this paper we study polynomial and geometric (exponential) ergodicity forM/G/1-type Markov chains and Markov processes. First, practical criteria for M/G/1-type Markov chains are obtained by analyzing the generating function of the first return probability to level 0. Then the corresponding criteria for M/G/1-type Markov processes are given, using their h-approximation chains. Our method yie...
متن کاملDetermination of Explicit Solution for a General Class of Markov Processes
In this paper, we study both the GI=M=1 type and the M=G=1 type Markov chains with the special structure A 0 = !. We obtain explicit formulas for matrices R and G, which generalized earlier results on Markov chains of QBD type. In the case of GI=M=1 type, we show how to nd the maximal eigenvalue of R, and then that the computation of R is equivalent to that of x 2. In the case of M=G=1 type, we...
متن کاملOn the Dual Relationship between Markov Chains of Gi/m/1 and M/g/1 Type
In 1990 Ramaswami proved that, given a Markov renewal process of M/G/1– type, one can construct a Markov renewal process of GI/M/1–type such that the matrix transforms G(z, s) for the M/G/1–type process and R(z, s) for the GI/M/1–type process satisfy a duality relationship. In his 1996 PhD thesis, Bright used time reversal arguments to show that it is possible to define a different dual for pos...
متن کاملClassification of Markov Processes of Matrix M/G/1 type with a Tree Structure and its Applications to the MMAP[K]/G[K]/1 Queue
The purpose of this paper is to study the classification problem of discrete time and continuous time Markov processes of matrix M/G/1 type with a tree structure. We begin this paper by developing a computational method to find whether a Markov process of matrix M/G/1 type with a tree structure is positive recurrent, null recurrent, or transient. The method is then used to study the impact of t...
متن کاملClassification of Markov Processes of Matrix M/G/1 type with a Tree Structure and its Applications to the MMAP[K]/G[K]/1 Queues
This paper studies the classification problem of discrete time and continuous time Markov processes of matrix M/G/1 type with a tree structure. It is shown that the Perron-Frobenius eigenvalue of a nonnegative matrix provides information for a complete classification of the Markov process of interest. A computational method is developed to find whether a Markov process of matrix M/G/1 type with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002